Tree - Decomposition Graph Minor Theory and Algorithmic Implications
نویسنده
چکیده
منابع مشابه
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
A key result of Robertson and Seymour’s graph minor theory is a structure theorem stating that all graphs excluding some fixed graph as a minor have a tree decomposition into pieces that are almost embeddable in a fixed surface. Most algorithmic applications of graph minor theory rely on an algorithmic version of this result. However, the known algorithms for computing such graph minor decompos...
متن کاملPlanar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is ...
متن کاملBranch and Tree Decomposition Techniques for Discrete Optimization
This chapter gives a general overview of two emerging techniques for discrete optimization that have footholds in mathematics, computer science, and operations research: branch decompositions and tree decompositions. Branch decompositions and tree decompositions along with their respective connectivity invariants, branchwidth and treewidth, were first introduced to aid in proving the Graph Mino...
متن کاملA Tourist Guide through Treewidth
A short overview is given of many recent results in algorithmic graph theory that deal with the notions treewidth, and pathwidth. We discuss algorithms that nd tree-decompositions, algorithms that use tree-decompositions to solve hard problems eeciently, graph minor theory, and some applications. The paper contains an extensive bibliography.
متن کاملNew upper bounds on the decomposability of planar graphs
It is known that a planar graph on n vertices has branch-width/ tree-width bounded by ffiffiffi n p . In many algorithmic applications, it is useful to have a small bound on the constant . We give a proof of the best, so far, upper bound for the constant . In particular, for the case of tree-width, < 3:182 and for the case of branch-width, < 2:122. Our proof is based on the planar separation th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013